Transition-Based Parsing
نویسنده
چکیده
Transition-based models for dependency parsing use a factorization defined in terms of a transition system, or abstract state machine. In this lecture, I will introduce the arc-eager and arcstandard transition systems for dependency parsing (§1) and discuss two different approaches to learning and decoding with these models: greedy classifier-based parsing (§2) and beam search and structured learning (§3). Finally, I will discuss different techniques for non-projective transition-based parsing (§4).
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملComparing Classifiers for (a special case of) Transition-Based Parsing
Transition-based parsing has proven to be very competitive. Part of the reason for this is that with respect to machine learning the parsing reduces to multi-class classification. This allows the use of very powerful machine learning algorithms such as Support Vector Machines. If we can find an even better classifier we would expect better parsing results. We will therefore try out different cl...
متن کاملEfficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States
Transition-based approaches based on local classification are attractive for dependency parsing due to their simplicity and speed, despite producing results slightly below the state-of-the-art. In this paper, we propose a new approach for approximate structured inference for transition-based parsing that produces scores suitable for global scoring using local models. This is accomplished with t...
متن کاملTransition-Based Parsing with Confidence-Weighted Classification
We show that using confidence-weighted classification in transition-based parsing gives results comparable to using SVMs with faster training and parsing time. We also compare with other online learning algorithms and investigate the effect of pruning features when using confidenceweighted classification.
متن کاملTransition-based Neural Constituent Parsing
Constituent parsing is typically modeled by a chart-based algorithm under probabilistic context-free grammars or by a transition-based algorithm with rich features. Previous models rely heavily on richer syntactic information through lexicalizing rules, splitting categories, or memorizing long histories. However enriched models incur numerous parameters and sparsity issues, and are insufficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010